Some Garbage In - Some Garbage Out: Asynchronous t-Byzantine as Asynchronous Benign t-resilient system with fixed t-Trojan-Horse Inputs

نویسندگان

  • Danny Dolev
  • Eli Gafni
چکیده

We show that asynchronous t faults Byzantine system is equivalent to asynchronous t-resilient system, where unbeknownst to all, the private inputs of at most t processors were altered and installed by a malicious oracle. The immediate ramification is that dealing with asynchronous Byzantine systems does not call for new topological methods, as was recently employed by various researchers: Asynchronous Byzantine is a standard asynchronous system with an input caveat. It also shows that two recent independent investigations of vector -agreement in the Byzantine model, and then in the fail-stop model, one was superfluous in these problems the change of t inputs allowed in the Byzantine has no effect compared to the fail-stop case. This result was motivated by the aim of casting any asynchronous system as a synchronous system where all processors are correct and it is the communication substrate in the form of messageadversary that misbehaves. Thus, in addition, we get such a characterization for the asynchronous Byzantine system. ∗Email: [email protected]. †Email: [email protected]. ar X iv :1 60 7. 01 21 0v 1 [ cs .D C ] 5 J ul 2 01 6

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Resilience Asynchronous Approximate Agreement

Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty processes decide on values that are at most from each other and are in the range of the initial values of the non-faulty processes. Previous constructions solved asynchronous approximate agreement only when there were at least ...

متن کامل

Asynchronous Byzantine Agreement Protocols

A consensus protocol enables a system of n asynchronous processes, some of them faulty, to reach agreement. Both the processes and the message system are capable of cooperating to prevent the correct processes from reaching decision. A protocol is t-resilient if in the presence of up to t faulty processes it reaches agreement with probability 1. Byzantine processes are faulty processes that can...

متن کامل

Almost-Asynchronous MPC with Faulty Minority

Secure multiparty computation (MPC) allows a set of parties to securely evaluate any agreed function of their inputs, even when up to t of the n parties are faulty. Protocols for synchronous networks (where every sent message is assumed to arrive within a constant time) tolerate up to t < n/2 faulty parties, whereas in the more realistic asynchronous setting (with no a priory information on max...

متن کامل

Modelling a Distributed Cached Store for Garbage Collection: The Algorithm and Its Correctness Proof

Caching and persistence support efficient, convenient and transparent distributed data sharing. The most natural model of persistence is persistence by reachability, managed automatically by a garbage collector (GC). We propose a very general model of such a system (based on distributed shared memory) and a scalable, asynchronous distributed GC algorithm. Within this model, we show sufficient a...

متن کامل

Exosomes: cell garbage can, therapeutic carrier, or trojan horse?

Ottawa Hospi pi pita ta tal l l Re Re Rese se s ar ar arch ch I I Ins ns nstitu tu tute te t

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1607.01210  شماره 

صفحات  -

تاریخ انتشار 2016